Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
نویسنده
چکیده
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain problems of structural model-based causality and explanation to be tractably solved. In this paper, we first address an open question raised by Eiter and Lukasiewicz – the computational complexity of deciding whether a given graph has a bounded layerwidth. After proving that this problem is NP-complete, we proceed by proving numerous important properties of layerwidth that are helpful in efficiently computing the optimal layerwidth. Finally, we compare this new DAG property to two other important DAG properties: treewidth and bandwidth.
منابع مشابه
Improving the Performance of RPL Routing Protocol for Internet of Things
The emerging Internet of Things (IoT) connects the physical world to the digital one and composes large networks of smart devices to support various applications. In order to provide a suitable communication in such networks, a reliable routing protocol is needed. In this paper, a modified version of an IPv6 Routing Protocol for Low-Power and Lossy networks (RPL), which has been standardized by...
متن کاملSALZA: Soft algorithmic complexity estimates for clustering and causality inference
A complete set of practical estimators for the conditional, simple and joint algorihmic complexities is presented, from which a semi-metric is derived. Also, new directed information estimators are proposed that are applied to causality inference on Directed Acyclic Graphs. The performances of these estimators are investigated and shown to compare well with respect to the state-ofthe-art Normal...
متن کاملExistence and uniqueness of the solution for a general system of operator equations in $b-$metric spaces endowed with a graph
The purpose of this paper is to present some coupled fixed point results on a metric space endowed with two $b$-metrics. We shall apply a fixed point theorem for an appropriate operator on the Cartesian product of the given spaces endowed with directed graphs. Data dependence, well-posedness and Ulam-Hyers stability are also studied. The results obtained here will be applied to prove the existe...
متن کاملStochastic Local Algorithms for Learning Belief Networks: Searching in the Space of the Orderings
An important type of methods for learning belief networks from data are those based on the use of a scoring metric, to evaluate the fitness of any given candidate network to the data base, and a search procedure to explore the set of candidate networks. In this paper we propose a new method that carries out the search not in the space of directed acyclic graphs but in the space of the orderings...
متن کاملA metric for galled networks
Galled networks, directed acyclic graphs that model evolutionary histories with reticulation cycles containing only tree nodes, have become very popular due to both their biological significance and the existence of polynomial time algorithms for their reconstruction. In this paper we prove that Nakhleh’s m measure is a metric for this class of phylogenetic networks and hence it can be safely u...
متن کامل